Concepts of a graph. Undirected graphs vs. directed graphs. Computer representation of graphs; Euler graph and De Bruijn sequences. Graph isomorphism. Shortest path algorithm. Minimum Spanning trees algorithms: Kruscal and Prim algorithms. Depth first search for directed and undirected graphs. Maximum flow in a network: Ford-Fulkerson Algorithm. NP-complete graph problems: graph coloring, maximum independent set, minimum vertex cover, traveling salesman problem.
The students assessment will be based on assignment, quizzes and exams